Error correction by Reed–Solomon codes using its automorphisms

نویسندگان

چکیده

The article explores the syndrome invariants of АГ-group automorphisms Reed–Solomon codes (RS-codes) that are a joint group affine and cyclic permutations. found real set norms N Г-orbits make up one or another АГ-orbit. vectors with 2 1 Cδ− coordinates from Galois field, determined by all kinds pairs components error syndromes. In this form, АГ-orbits were cumbersome difficult to use. Therefore, their replacement conditional partial is proposed. These quasi-invariants called norm-projections. Norm-projection uniquely identifies its АГ-orbit therefore serves as an adequate way for formulating correction method RS-codes based on АГ-orbits. power estimated value N2, equal square length RS-code. search in transmitted messages new reduced parsing АГ‑orbits, but actually norm-projections, subsequent these errors within particular proposed works almost N2 times faster than traditional methods, operating basic “syndrome – error” principle, boils down entire until specific vector found.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Error-Correction Codes on Abelian Groups

We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.

متن کامل

Using codes for error correction and detection

Absiruct-A linear code C over GF( q) is good for t-error-correction and error detection if P(C, t; c) I P(C, t; (q 1)/q) for all z, 0 s c I (q 1)/q, where P( C, t; c) is the probability of an undetected error after a codeword in C is transmitted over a q-ary symmetric channel with error probability c and correction is performed for ail error patterns with t or fewer errors. A sufficient conditi...

متن کامل

Efficient Burst Error Correction by Hermitian Codes

Hermitian codes belong to a powerful class of algebraic geometry codes, which allow to correct many independent errors. We show that Hermitian codes can correct many bursts of errors as well. Decoding of a Hermitian (N,K) code over q2 can be reduced to decoding of interleaved extended Reed-Solomon codes. Using this fact, we propose an efficient unique decoding algorithm correcting up to (N −K)/...

متن کامل

Quantum Error Correction Codes

This report contains the comprehensive explanation of some most important quantum error correction codes. After the brief corroboration of the quantum mechanical principles that govern any quantum mechanical process, we introduce stabilizer formalism and stabilizer codes for quantum error correction (QEC). As an interesting derivative from classical counterpart we also present Quantum Reed Mull...

متن کامل

Low-cost single error correction multiple adjacent error correction codes

Soft errors that affect flip-flops are a major issue in advanced electronic circuits. As technology scales, multiple bit errors become more likely. This limits the applicability of traditional protection techniques like triplication with voting or single error correction codes that can correct only one error. Multiple errors tend to affect adjacent bits, and therefore it is interesting to use e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ????? ???????????? ???????? ????? ????????

سال: 2021

ISSN: ['2524-2377', '2524-2369']

DOI: https://doi.org/10.29235/1561-8358-2021-66-1-110-116